Path graph - PDFSEARCH.IO - Document Search Engine

Path graph
Results: 1083

#	Item
251	CCCG 2003, Halifax, Nova Scotia, August 11–13, 2003 Network Design Subject to Facility Location J. Bhadury∗, R. Chandrasekaran†, L. Gewali‡ Abstract Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2004-01-08 18:44:36 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Vertex cover Tree Steiner tree problem Widest path problem Graph theory Theoretical computer science Mathematics
252	A Glider for Every Graph: Exploring the Algorithmic Requirements for Rotationally Invariant, Straight-Line Motion Add to Reading List Source URL: www.complex-systems.com Language: English - Date: 2012-06-20 13:21:03 Combinatorial optimization Routing algorithms Graph A* search algorithm Planar graph Algorithm Force-based algorithms Path decomposition Graph theory Mathematics Search algorithms
253	ICS 163 – Spring 2002 – Final Exam Name: Student ID: 1: Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2002-06-12 18:57:00 Graph Edge coloring Path decomposition Graph theory Planar graphs Graph coloring
254	Journal of Graph Algorithms and Applications http://jgaa.info/ vol. 0, no. 0, pp. 0–0 (0) Inapproximability of Orthogonal Compaction Michael J. Bannister David Eppstein Joseph A. Simons Computer Science Department, Add to Reading List Source URL: jgaa.info Language: English - Date: 2012-03-09 04:02:51 NP-complete problems Graph coloring Topological graph theory Angular resolution Eulerian path Planar graph Graph Edge coloring Petersen graph Graph theory Mathematics Graph drawing
255	On Computing Graph Minor Obstruction Sets ∗ Kevin Cattell Department of Computer Science University of Victoria Victoria, B.C. V8W 3P6, Canada Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-06 02:54:05 Robertson–Seymour theorem Tree decomposition Minor Planar graph Linkless embedding Graph coloring Graph structure theorem Clique-sum Graph theory Graph operations Path decomposition
256	Computing Science TACKLING THE PARTNER UNITS CONFIGURATION PROBLEM Markus Aschinger, Conrad Drescher, Gerhard Friedrich, Georg Gottlob, Peter Jeavons, Anna Ryabokon, Evgenij Thorstensen Add to Reading List Source URL: www.cs.ox.ac.uk Language: English - Date: 2013-06-06 21:32:58 Induced path Graph Matroid theory Graph coloring NP-complete problems Pseudoforest Graph theory Graph operations Path decomposition
257	The Complexity Ecology of Parameters: An Illustration Using Bounded Max Leaf Number ? Michael Fellows1,2 and Frances Rosamond1 Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-08-06 03:12:58 NP-complete problems Analysis of algorithms Parameterized complexity Kernelization Bidimensionality Dominating set Tree decomposition Path decomposition Feedback vertex set Theoretical computer science Computational complexity theory Graph theory
258	CCCG 2006, Kingston, Ontario, August 14–16, 2006 A Study of Conway’s Thrackle Conjecture Wei Li ∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2006-06-29 12:00:12 Degree Graph Hamiltonian path Petersen graph Graph theory Mathematics Theoretical computer science
259	CCCG 2007, Ottawa, Ontario, August 20–22, 2007 On Rolling Cube Puzzles Kevin Buchin∗ Maike Buchin∗ Add to Reading List Source URL: cccg.ca Language: English - Date: 2008-10-28 21:27:49 Graph Path Graph operations Implicit graph Line graph Graph theory NP-complete problems Hamiltonian path
260	CCCG 2010, Winnipeg MB, August 9–11, 2010 I/O Efficient Path Traversal in Well-Shaped Tetrahedral Meshes Craig Dillabaugh Abstract Add to Reading List Source URL: cccg.ca Language: English - Date: 2010-07-19 10:46:17 Deltahedra Platonic solids Self-dual polyhedra Tetrahedron Stellated octahedron Neighbourhood Polychora Octahedron Planar separator theorem Geometry Graph theory Euclidean geometry

UPDATE